Hidden Symmetries in Simple Graphs

نویسنده

  • Allen D. Parks
چکیده

It is shown that each element σ in the normalizer of the automorphism group Aut(G) of a simple graph G with labeled vertex set V is an Aut(G) invariant isomorphism between G and the graph obtained from G by the σ permutation of V—i.e., σ is a hidden permutation symmetry of G. A simple example illustrates the theory and the applied notion of system robustness for reconfiguration under symmetry constraint (RUSC) is introduced.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hidden Symmetries in Real and Theoretical Networks

Symmetries are ubiquitous in real networks and often characterize network features and functions. Here we present a generalization of network symmetry called latent symmetry, which is an extension of the standard notion of symmetry. They are defined in terms of standard symmetries in a reduced version of the network. One unique aspect of latent symmetries is that each one is associated with a s...

متن کامل

Complete Graphs whose Topological Symmetry Groups are Polyhedral

Characterizing the symmetries of a molecule is an important step in predicting its chemical behavior. Chemists have long used the group of rigid symmetries, known as the point group, as a means of representing the symmetries of a molecule. However, molecules which are flexible or partially flexible may have symmetries which are not included in the point group. Jon Simon [11] introduced the conc...

متن کامل

ar X iv : q ua nt - p h / 03 04 09 0 v 4 1 9 Ju n 20 06 HIDDEN SYMMETRY DETECTION ON A QUANTUM COMPUTER

The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with f (U [x]) = f (x). Following a discussion regarding which tasks might be solved efficiently by quantum computers, it will be demonstrated by means of a simple example, that the detection of more general hidden (two-point) symmetries V {f (x...

متن کامل

Setting Hidden Symmetries Free by the Noncommutative Veronese Mapping

The note is devoted to the setting free of hidden symmetries in Verma modules over sl(2, C) by the noncommutative Veronese mappings. In many cases the behavior of systems is governed not only by their natural (geometric) symmetries but also by hidden ones. The main difficulty to work with hidden symmetries is that they are often ”packed”, and as a rule can’t be ”unpacked” to the universal envel...

متن کامل

Calculations of Dihedral Groups Using Circular Indexation

‎In this work‎, ‎a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$‎. ‎Each element of the sequence represents a vertex of the polygon‎. ‎Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis‎. ‎Here each symmetry is considered as a system that takes an input circular sequence and g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Symmetry

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2012